Speeding up dynamic programming with applications to molecular biology
نویسندگان
چکیده
منابع مشابه
Speeding Up Dynamic Programming with Applications to
Consider the problem of computing E[j] = mit:! {D[k] + w(k, j)}, j = 1, ... , n, O~k~]-l where w is a given weight function, D[D] is given and for every k = 1, ... , n, D[k] is easily computable from E[k]. This problem appears as a subproblem in dynamic programming solutions to various problems. Obviously, it can be solved in time O( n ), and for a general weight function no better algorithm is...
متن کاملSpeeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
We extend the algorithm of Galil and Giancarlo, which speeds up dynamic programming in the case of concave cost functions, such that a compact representation of all optimal solutions is computed. Compared to the Galil-Giancarlo algorithm our time bound grows only by a small constant factor. With a compact representation, we develop eecient algorithms for the solution of problems in molecular bi...
متن کاملSpeeding up Dynamic Programming
A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders...
متن کاملSpeeding up computations via molecular biology
We show how to extend the recent result of Adleman 1] to use biological experiments to directly solve any NP problem. We, then, show how to use this method to speedup a large class of important problems.
متن کاملSpeeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic optimization problems. This class includes several variants of discrete stochastic shortest path, scheduling, and knapsack problems, all of which involve making a series of decisions over time that have stochastic con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90101-1